Dense Time Logic Programming
نویسندگان
چکیده
منابع مشابه
Polynomial-Time Learning in Logic Programming and Constraint Logic Programming
Induction in rst-order logic languages suuers from an additional factor of complexity compared to induction in attribute-value languages: the number of possible matchings between a candidate hypothesis and a training example. This paper investigates the use of a stochastic bias to control this factor of complexity: the exhaustive exploration of the matching space is replaced by considering a xe...
متن کاملA Decidable Dense Branching-Time Temporal Logic
Timed computation tree logic (Tctl) extends Ctl by allowing timing constraints on the temporal operators. The semantics of Tctl is deened on a dense tree. The satissability of Tctl-formulae is undecidable even if the structures are restricted to dense trees obtained from timed graphs. According to the known results there are two possible causes of such undecidability: the denseness of the under...
متن کاملCactus: A Branching-Time Logic Programming Language
Temporal programming languages are recognized as natu ral and expressive formalisms for describing dynamic systems However most such languages are based on linear ow of time a fact that makes them unsuitable for certain types of applications In this paper we in troduce the new temporal logic programming language Cactus which is based on a branching notion of time In Cactus the truth value of a ...
متن کاملChronolog (Z): Linear-Time Logic Programming
This paper introduces Chronolog(Z), a logic programming language based on a discrete linear-time temporal logic with unbounded past and future. Chronolog(Z) is suitable for applications involving the notion of dynamic change, such as modeling non-terminating computations, the simulation of sequential circuits, and temporal databases. The execution of the programs of the language is based on a r...
متن کاملAverage Time Analyses Related to Logic Programming
Logic programs are known to be amenable to parallelization. Our work is an attempt to quantify the magnitude of speed-up one can expect from parallel execution of a logic program. To make average case analysis tractable we look separately at two aspects of logic program execution: the \subgoaling" aspect, which involves trying to prove a goal by using matching to reduce it to other goals and na...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 1996
ISSN: 0747-7171
DOI: 10.1006/jsco.1996.0067